Parallel Globally Adaptive Quadrature on the KSR
نویسندگان
چکیده
New algorithms for parallel one-dimensional globally adaptive quadrature are developed. The algorithms are implemented on a Kendall Square Research KSR-1 parallel computer and numerical results are presented. The most successful algorithm gives signiicant speedups on a range of hard problems, including ones with singular integrands.
منابع مشابه
Parallel Globally Adaptive Algorithms for Multi-dimensional Integration
We address the problem of implementing globally adaptive algorithms for multi-dimensional numerical integration on parallel computers. By adapting and extending algorithms which we have developed for one-dimensional quadrature we develop algorithms for the multi-dimensional case. The algorithms are targeted at the lat-est generation of parallel computers, and are therefore independent of the ne...
متن کاملReducing Ranking Effects in Parallel Adaptive Quadrature
We develop parallel one-dimensional globally adaptive quadrature algorithms, building on NAG code D01AKF. Our most eeective strategy replaces D01AKF's error estimate ranking strategy by a tabulation approach. D01AKF uses 61-point Gauss-Kronrod (GK) quadrature. We also use the 21-point GK rule. A fuller discussion, with expanded results, is given in 7].
متن کاملVirtual Shared Memory and Distributed Memory Implementations of Parallel Algorithms for Numerical Integration
Parallel globally adaptive algorithms for numerical integration provide a simple example of algorithms that exploit control parallelism. In this paper we consider the implementation of such algorithms on both virtual shared memory (KSR-1) and distributed memory (iPSC/860) machines and investigate how the characteristics of the diierent architectures aaect the choice of implementation and thereb...
متن کاملHyper-Rectangle Selection and Distribution Algorithm for Parallel Adaptive Numerical Integration
In this paper we consider parallel numerical integration algorithms for multi-dimensional integrals. A new hyper-rectangle selection strategy is proposed for the implementation of globally adaptive parallel quadrature algorithms. The well known master-slave parallel algorithm prototype is used for the realization of the algorithm. Numerical results on the SP2 computer and on a cluster of workst...
متن کاملA Parallel GRASP Implementation for the Quadratic Assignment Problem
A greedy randomized adaptive search procedure for maximum independent set. A greedy randomized adaptive search procedure for the quadratic assignment problem. subroutines for approximate solution of dense quadratic assignment problems using GRASP. Table 2: grasp-parallel-sparse empty permutation, and local search is applied to the constructed solution for further improvement. The best solution ...
متن کامل